Caw topdown inserts aebe after a, b found

Multiple output predicates 
- possibly eliminate rules from different branches with same output x wouldn’t have these unless above
- produces vars needed in order, before first time needed

Use f x y with inputs and outputs together

Semi-complete outputs for pf at first, 
Use inputted program, query and data to find interpreter
Use li sts - identify lists
How will find varlist, (set theory) verification, predicates, scope, or, etc
A length b length from data, this is difficult
Break down into subpredicates + in +- - add on other features
Give fail data to tighten verification

- identify interpreter from q, program and data, find ouput for a program in this language
- identifies rule for other rule name and data
- amalgamates rules in interpreter program
- 
Program formats for appropriate uses
- decompose, ...
- dbff build, verify when o not in i

Iterative deepening